Total domination supercritical graphs with respect to relative complements
نویسندگان
چکیده
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number t(G) is the minimum cardinality of a total dominating set of G. Let G be a connected spanning subgraph of Ks;s, and let H be the complement of G relative to Ks;s; that is, Ks;s = G ⊕ H is a factorization of Ks;s. The graph G is k-supercritical relative to Ks;s if t(G) = k and t(G + e) = k − 2 for all e∈E(H). Properties of k-supercritical graphs are presented, and k-supercritical graphs are characterized for small k. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]
A total dominating set of a graph G is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G, denoted by γt(G), is the minimum cardinality of a total dominating set. Let G be a connected spanning subgraph of Ks,s and letH be the complement of G relative to Ks,s; that is, Ks,s = G⊕H . The graph G is k-supercritical relative to Ks,s if γt(G...
متن کاملDomination critical graphs with respect to relative complements
Let G be a spanning subgraph of Ks,s and let H be the complement of G relative to Ks,s; that is, Ks,s = GtJ)H is a factorization of Ks,s' The graph G is ,,(-critical relative to Ks,s if ,(G) = , and "(( G + e) = , 1 for all e E E(H), where ,(G) denotes the domination number of G. We investigate ,,(-critical graphs for small values of "(. The 2-critical graphs and 3-critical graphs are character...
متن کاملTotal domination in complements of graphs containing no K4, 4
We show that the total domination number of a graph G whose complement , G c , does not contain K3;3 is at most (G c), except for complements of complete graphs, and graphs belonging to a certain family which is characterized. In the case where G c does not contain K4;4 we show that there are four exceptional families of graphs, and determine the total domination number of the graphs in each one.
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملTotal double Roman domination in graphs
Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 258 شماره
صفحات -
تاریخ انتشار 2002